A Computational Framework for Two-Dimensional Random Walks With Restarts

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hitting Times for Random Walks with Restarts

The time it takes a random walker in a lattice to reach the origin from another vertex x, has infinite mean. If the walker can restart the walk at x at will, then the minimum expected hitting time γ(x, 0) (minimized over restarting strategies) is finite; it was called the “grade” of x by Dumitriu, Tetali and Winkler. They showed that, in a more general setting, the grade (a variant of the “Gitt...

متن کامل

Growing Networks Through Random Walks Without Restarts

Network growth and evolution is a fundamental theme that has puzzled scientists for the past decades. A number of models have been proposed to capture important properties of real networks. In an attempt to better describe reality, more recent growth models embody local rules of attachment, however they still require a primitive to randomly select an existing network node and then some kind of ...

متن کامل

Estimating graph parameters via random walks with restarts

In this paper we discuss the problem of estimating graph parameters from a random walk with restarts. In this setting, an algorithm observes the trajectory of a random walk over an unknown graph G, starting from a vertex x. The algorithm also sees the degrees along the trajectory. The only other power that the algorithm has is to request that the random walk be reset to its initial state x at a...

متن کامل

Deterministic Random Walks on the Two-Dimensional Grid

Jim Propp’s rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed order. We analyze the difference between Propp machine and random walk on the infinite two-dimensional grid. It is known that, apart from a technicality, independent of the starting configuration, at each time, the number of ...

متن کامل

Collision Problems of Random Walks in Two-Dimensional Time*

Let (Xij: i > 0, i > 0} be a double sequence of independently, identically distributed random variables (i.i.d.) which takes values in the d-dimensional integer lattice Ed . The double sequence {Sm,,: m > 0, n > 0} defined by Sllan= xy=, zyW, Xgj is called the random walk in two-dimensional time generated by 41, or a two-parameter random walk, or simply a random walk when there is no danger of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Scientific Computing

سال: 2020

ISSN: 1064-8275,1095-7197

DOI: 10.1137/19m1304362